Polynomial-time approximation scheme

#	Item
51	PDF Document Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2007-02-16 07:21:01 Complexity classes NP-complete problems Closest string Parameterized complexity Clique problem Vertex cover Polynomial-time approximation scheme String Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
52	PDF Document Add to Reading List Source URL: graphics.stanford.edu Language: English - Date: 2005-12-05 15:22:50 Complexity classes NP-complete problems Approximation algorithms Operations research Travelling salesman problem Polynomial-time approximation scheme APX Optimization problem NP Theoretical computer science Computational complexity theory Applied mathematics